COMPUTING RESOURCE AND WORK ALLOCATIONS USING SOCIAL PROFILES

Computing Resource and Work Allocations using Social Profiles

If several distributed and disparate computer resources exist, many of which have been created for different and diverse reasons, and several large scale computing challenges also exist with similar diversity in their backgrounds, then one problem which arises in trying to assemble enough of these resources to address such challenges is the need to align and accommodate the different motivation...

Computational Microscopy Petascale Computing Resource Allocations (prac)

Computing optimal randomized resource allocations for massive security games

Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theoretic methods to find optimal randomized security policies, including a fielded application at the Los Angeles International Airport (LAX). This approach has promising applications in many similar domains, including pol...

Computing the Envelope for Stepwise-Constant Resource Allocations

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events...

Computing Optimal Randomized Resource Allocations for Massive Security Games

Predictable allocations of security resources such as police officers, canine units, or checkpoints can be exploited by potential attackers. Recent work has applied game-theoretic methods to determine optimal randomized security policies, including a fielded application at the Los Angeles International Airport (LAX). However, the existing methods do not scale well for problems where a defender ...